@InProceedings{RizziPomOliChaLor:2017:MeHíAp,
               author = "Rizzi, Mateus Matos and Pomari, Carlos Zaca and Oliveira, Rudinei 
                         Martins de and Chaves, Antonio Augusto and Lorena, Luiz Antonio 
                         Nogueira",
          affiliation = "{Universidade Federal do ABC (UFABC)} and {Universidade Federal de 
                         S{\~a}o Paulo (UNIFESP)} and {Universidade Federal de S{\~a}o 
                         Paulo (UNIFESP)} and {Universidade Federal de S{\~a}o Paulo 
                         (UNIFESP)} and {Instituto Nacional de Pesquisas Espaciais 
                         (INPE)}",
                title = "Metaheur{\'{\i}}stica h{\'{\i}}brida aplicada ao problema de 
                         aloca{\c{c}}{\~a}o t{\'a}tica de ber{\c{c}}os",
            booktitle = "Anais...",
                 year = "2017",
         organization = "Simp{\'o}sio Brasileiro de Pesquisa Operacional, 49.",
             keywords = "Metaheur{\'{\i}}stica h{\'{\i}}bida, Busca local, 
                         Sequenciamento, Hybrid metaheuristic, Local search, Scheduling.",
             abstract = "O objetivo deste trabalho {\'e} aplicar o m{\'e}todo 
                         h{\'{\i}}brido Clustering Search (CS) em conjunto com o Biased 
                         Random Key Genetic Algorithm (BRKGA) ao problema de 
                         aloca{\c{c}}{\~a}o t{\'a}tica de ber{\c{c}}os (TBAP). O TBAP 
                         consiste em alocar navios nos ber{\c{c}}os e definir o perfil de 
                         guindastes que ser{\~a}o usados para descarregamento e 
                         carregamento das cargas, buscando minimizar o custo de 
                         servi{\c{c}}o em transferir as cargas entre os navios atracados e 
                         otimizar a utiliza{\c{c}}{\~a}o dos guindastes 
                         dispon{\'{\i}}veis para as tarefas. Para a valida{\c{c}}{\~a}o 
                         dos resultados, foram utilizados tr{\^e}s conjuntos de 
                         inst{\^a}ncias e as solu{\c{c}}{\~o}es foram comparadas com 
                         outros m{\'e}todos dispon{\'{\i}}veis na literatura. ABSTRACT: 
                         This paper aims to apply the hybrid method Clustering Search (CS) 
                         with the Biased Random Key Genetic Algorithm (BRKGA) on the 
                         Tactical Berth Allocation Problem (TPAB). The TPAB consists of 
                         allocate incoming ships to berthing positions and assign quay 
                         crane profile to them. The goals of the TBAP are both the 
                         minimization of the housekeeping costs derived from the 
                         transshipment container flows between ships, and the maximization 
                         of the total value of the quay crane profiles assigned to the 
                         ships. To validate the computational results, it was used three 
                         sets of instances available on literature and the proposed method 
                         is compared with other solution approaches.",
  conference-location = "Blumenau, SC",
      conference-year = "27-30 ago.",
           targetfile = "rizzi_metaheuristica.pdf",
        urlaccessdate = "27 abr. 2024"
}